421A - Pasha and Hamsters - CodeForces Solution

/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool
 *(Windows, macOS, Linux) Author: lugot Time: 2023-05-24 22:44:26
 **/

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int n, a, b;
int A[200], B[200];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> a >> b;
    for (int i = 0; i < a; ++i) cin >> A[i];
    for (int i = 0; i < b; ++i) cin >> B[i];

    for (int i = 0; i < n; ++i) {
        if (find(A, A + a, i + 1) != A + a) {
            cout << 1 << " ";
        } else {
            cout << 2 << " ";
        }
    }

    return 0;
}